Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.     

Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions

Two algorithms for finding a global minimum of the product of two affine fractional functions over a compact convex set and solving linear fractional programs with an additional constraint defined by the product of two affine fractional functions are proposed. The algorithms are based on branch and bound techniques using an adaptive branching operation which takes place in one-dimensional intervals. Results from numerical experiments show that large scale problems can be efficiently solved by the proposed methods.     

Applying the Pfaffianization Procedure to the Two-Dimensional Leznov Lattice

We derive Wronskian and Grammian determinant solutions for the two-dimensional Leznov lattice and provide a Pfaffianized version of this Leznov lattice using Hirota and Ohta’s Pfaffianization procedure. We give the Gramm-type Pfaffian solution for the Pfaffianized system explicitly.__________Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 144, No. 3, pp. 484–491, September, 2005.     

Controlled/living polymerization of 2‐(diethylamino)ethyl methacrylate and its block copolymer with tert‐butyl methacrylate by atom transfer radical polymerization

Polymerization of 2‐(diethylamino)ethyl methacrylate (DEAEMA) via homogeneous atom transfer radical polymerization under various reaction conditions is described. The effects of the initiators and solvents were examined. With 1,1,4,7,10,10‐hexamethyl triethylenetetramine/copper(I) chloride/p‐toluenesulfonyl chloride as the ligand/catalyst/initiator system in methanol, poly(DEAEMA) with a polydispersity index as low as 1.07 was synthesized. Kinetic studies demonstrated the polymerization was very well controlled and exhibited the living characteristic of the process. Well‐defined block copolymers of DEAEMA and tert‐butyl methacrylate (tBMA) were successfully synthesized. The copolymers could be synthesized with equally good results by starting with either p(DEAEMA) or p(tBMA) as the macroinitiators. However, only the macroinitiators terminated with chlorine should be used. The corresponding macroinitiators with bromine as a transferable group did not yield well‐defined copolymers. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 2688–2695, 2003     

用于机械振动实时监测的光纤光栅有源传感装置

把一对中心反射波长分别为1562.11nm和1562.71nm的光纤光栅粘贴在均质、等厚、等腰三角形悬臂梁上下表面作为环形腔光纤激光器端镜，当机械振动激励自由端时，通过观测激光输出脉冲，地施加于自由端的机械振动的频率进行了实时监测；观察两光栅波长漂移量差值的变化，可在0～6.1mm的范围内判断所测振动的振幅。低于100Hz时，实验结果与实际值基本吻合。     

A Multidimensional Branch-and-Prune Method for Interval Global Optimization

In this paper a new multidimensional extension of the recently developed one-dimensional enclosure method called kite is given for interval global optimization. A more sophisticated version of the pruning technique based on the kite method is introduced. By the new componentwise approach all the one-dimensional theoretical results and procedures can be used in the higher-dimensional case. The possibilities in the implementation of the new algorithm together with numerical results on 40 standard test problems are presented.